Inter - Semester 2011 Handout 13 1 5 Traffic Grooming inWavelength - RoutedWDMNet
نویسنده
چکیده
In the last chapter, we assume that each source-destination (s-d) pair has its taffic demand equal to an integer multiple of wavelength unit. Accordingly, supporting such traffic in transparent wavelength division multiplexing (WDM) networks can be done by establishing lightpaths between s-d pairs. In addition, these established lightpaths will be fully utilized. In this chapter, we allow for subwavelength traffic. For example, the traffic of an s-d pair may be equal to 0.3 wavelength unit. In this type of scenario, a single lightpath may carry multiple traffic streams from different s-d pairs. This multiplexing of several traffic streams onto a common lightpath is called traffic grooming, which is necessary for efficient wavelength channel usages. Consequently, the traffic of an s-d pair may have to flow on multiple lightpaths so that efficient traffic grooming can be performed at intermediate switching nodes. We shall first discuss traffic grooming in backbone WDM networks. Later on, we shall consider traffic grooming in ring networks which are commonly used for metropolitan WDM networks. We focus on static traffic, with some discussion on dynamic traffic given in the final section.
منابع مشابه
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
We study the following graph partitioning problem: Given two positive integers C and Δ, find the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ can be partitioned into subgraphs with at most C edges and each vertex appears in at most M(C,Δ) subgraphs. This problem is naturally motivated by traffic grooming, which is a major issue in optical networks. Namely,...
متن کاملApproximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses at most 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) need two SONET add-drop multiplexers (ADMs) at each end node ; using grooming different requests can share the...
متن کاملInter-Domain Traffic Engineering for Balanced Network Load
Inter-domain cooperation at control plane level offers the possibility to balance the traffic in a much more flexible way compared to the single domain Traffic Engineering (TE) methods. This solution is especially effective if the offered traffic and the network load permits to avoid congestion without recomputing the routes. Current networking technologies and the emerging trends in aggregatio...
متن کامل197-2011: Flow Isolation in Power-Efficient Traffic-Grooming Problems in Optical Networks
We address the issue of ensuring the integrity and privacy of communications in optical networks in this paper. For this purpose, the traffic-grooming concept has been extended to include the flow isolation constraints through a multiclass traffic model. We develop ILP formulations and implement and solve them with SAS/OR ® OPTMODEL. Our approach guarantees that only traffic components within t...
متن کاملSelect Line Speeds for Single-Hub SONET/WDM Ring Networks
Minimizing SONET ADM costs in single-hub SONET/WDM ring networks via traffic grooming has been discussed in a number of recent works. Recent work [12] gives the exact minimum costs of uniform traffic in both UPSR and BLSR/2 and proves that the BLSR/2 would never be more expensive than UPSR under any traffic pattern, if all wavelengths have same capacity. In this paper we consider how to groom b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011